Human Re-identification through Distance Metric Learning based on Jensen-Shannon Kernel

نویسندگان

  • Yoshihisa Ijiri
  • Shihong Lao
  • Tony X. Han
  • Hiroshi Murase
چکیده

Human re-identification, i. e., human identification across cameras without an overlapping view, has important applications in video surveillance. The problem is very challenging due to color and illumination variations among cameras as well as the pose variations of people. Assuming that the color of human clothing does not change quickly, previous work relied on color histogram matching of clothing. However, naive color histogram matching across camera network is not robust enough for human re-identification. Therefore, we learned an optimal distance metric between color histograms using a training dataset. The Jensen-Shannon kernel is proposed to learn nonlinear distance metrics. The effectiveness of the proposed method is validated by experimental results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...

متن کامل

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

Graph Characteristics from the Quantum Jensen-Shannon Graph Kernel

In this paper, we use the quantum Jensen-Shannon divergence as a means to establish the similarity between a pair of graphs and to develop a novel graph kernel. In quantum theory, the quantum Jensen-Shannon divergence is defined as a distance measure between quantum states. In order to compute the quantum Jensen-Shannon divergence between a pair of graphs, we first need to associate a density o...

متن کامل

Scalable Metric Learning via Weighted Approximate Rank Component Analysis

Our goal is to learn a Mahalanobis distance by minimizing a loss defined on the weighted sum of the precision at different ranks. Our core motivation is that minimizing a weighted rank loss is a natural criterion for many problems in computer vision such as person re-identification. We propose a novel metric learning formulation called Weighted Approximate Rank Component Analysis (WARCA). We th...

متن کامل

Learning Affine Hull Representations for Multi-Shot Person Re-Identification

We consider the person re-identification problem, assuming the availability of a sequence of images for each person, commonly referred to as video-based or multi-shot reidentification. We approach this problem from the perspective of learning discriminative distance metric functions. While existing distance metric learning methods typically employ the average feature vector as the data exemplar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012